Packing Trominoes is NP-Complete, #P-Complete and ASP-Complete
نویسندگان
چکیده
We study the computational complexity of packing puzzles of identical polyominoes. Packing dominoes (i.e., 1 × 2 rectangles) into grid polygons can be solved in polynomial time by reducing to a bipartite matching problem. On the other hand, packing 2 × 2 squares is known to be NP-complete. In this paper, we fill the gap between dominoes and 2 × 2 squares, that is, we consider the packing puzzles of trominoes. Note that there exist only two shapes of trominoes: L-shape and I-shape. We show that their packing problems are both NP-complete. Our reductions are carefully designed so that we can also prove #P-completeness and ASPcompleteness of the counting and the another-solutionproblem variants, respectively.
منابع مشابه
Fillmat is NP-Complete and ASP-Complete
We study the computational complexity of a packing puzzle Fillmat, which is a type of pencil-and-paper puzzles made by Japanese puzzle publisher Nikoli. We show that the problem to decide if a given instance of Fillmat has a solution is NP-complete by a reduction from the circuit-satisfiability problem (Circuit-SAT). Our reduction is carefully designed so that we can also prove ASP-completeness...
متن کاملHard and Easy Instances of L-Tromino Tilings
In this work we study tilings of regions in the square lattice with L-shaped trominoes. Deciding the existence of a tiling with L-trominoes for an arbitrary region in general is NP-complete, nonetheless, we indentify restrictions to the problem where either it remains NP-complete or it has a polynomial time algorithm. First we show that an aztec diamond of order n always has an L-tromino tiling...
متن کاملTotal Tetris : Tetris with Monominoes , Dominoes , Trominoes , Pentominoes , . .
We consider variations on the classic video game Tetris where pieces are k-ominoes instead of the usual tetrominoes (k = 4), as popularized by the video games ntris and Pentris. We prove that it is NP-complete to survive or clear a given initial board with a given sequence of pieces for each k ≥ 5, complementing the previous NP-completeness result for k = 4. More surprisingly, we show that boar...
متن کاملPacking 2×2 unit squares into grid polygons is NP-complete
In a packing problem, the goal is to put some small objects disjointly into a large container, while optimizing some objective function. The packing problem is very general, and a rich variety of objects and containers are possible. One major split in the taxonomy of packing concerns whether the objects to be packed are allowed to be different or are all identical. In the case of identical pack...
متن کاملNP - completeness Results for NONOGRAM
We introduce a new class of NP problems called ANOTHER SOLUTION PROBLEMs. For a given NP problem X, ANOTHER SOLUTION PROBLEM for X (ASP for X) is to ask, for a given instance I for X and its solution, whether there is another solution for I. The di culty of ASP for X may not be immediate from the di culty of X. For example, for some NP-complete problems such as 3SAT or 3DM, it is easy to show t...
متن کامل